An elementary proof of some differential inequalities

extensions of some polynomial inequalities to the polar derivative

توسیع تعدادی از نامساوی های چند جمله ای در مشتق قطبی

An elementary proof of some functional inequalities on paths space for Lévy processes by a cylindrical method

Extending Arcs: An Elementary Proof

In a finite projective plane π we consider two configuration conditions involving arcs in π and show via combinatorial means that they are equivalent. When the conditions hold we are able to obtain embeddability results for arcs, all proofs being elementary. In particular, when π = PG(2, q) with q even we provide short proofs of some well known embeddability results.

An Elementary Proof of Private Random Number Generation from Bell Inequalities

The field of device-independent quantum cryptography has seen enormous success in the past several years, including security proofs for key distribution and random number generation that account for arbitrary imperfections in the devices used. Full security proofs in the field so far are long and technically deep. In this paper we show that the concept of the mirror adversary can be used to sim...

An elementary proof of the reconstruction conjecture

The reconstruction conjecture states that the multiset of vertex-deleted subgraphs of a graph determines the graph, provided it has at least 3 vertices. This problem was independently introduced by Stanis law Ulam (1960) and Paul Kelly (1957). In this paper, we prove the conjecture by elementary methods. It is only necessary to integrate the Lenkle potential of the Broglington manifold over the...